The Perimeter and Site-Perimeter of Set Partitions
نویسندگان
چکیده
منابع مشابه
Least - Perimeter Partitions of the Sphere
We consider generalizations of the honeycomb problem to the sphere S and seek the perimeter-minimizing partition into n regions of equal area. We provide a new proof of Masters’ result that three great semicircles meeting at the poles at 120 degrees minimize perimeter among partitions into three equal areas. We also treat the case of four equal areas, and we prove under various hypotheses that ...
متن کاملThe perimeter in site directed percolation. Mean perimeter expansions
2014 Exact expansions for susceptibility 2014 like mean perimeter series for directed percolation and extended mean size series are analysed, on two and three dimensional lattices. The critical threshold pc estimates are refined for the triangular and simple cubic lattices. On the square next-nearest-neighbour site problem pc is estimated as pc = 0.4965 ± 0.002. J. Physique 47 (1986) 943-946 JU...
متن کاملThe Site Perimeter of Bargraphs
The site perimeter enumeration of polyominoes that are both columnand row-convex is a well-understood problem that always yields algebraic generating functions. Counting more general families of polyominoes is a far more difficult problem. Here Mireille BousquetMélou and Andrew Rechnitzer enumerate (by their site perimeter) the simplest family of polyominoes that are not fully convex—bargraphs....
متن کاملMinimum Perimeter-Sum Partitions in the Plane
Let P be a set of n points in the plane. We consider the problem of partitioning P into two subsets P1 and P2 such that the sum of the perimeters of ch(P1) and ch(P2) is minimized, where ch(Pi) denotes the convex hull of Pi. The problem was first studied by Mitchell and Wynters in 1991 who gave an O(n2) time algorithm. Despite considerable progress on related problems, no subquadratic time algo...
متن کاملPolyominoes with minimum site-perimeter and full set achievement games
The site-perimeter of a polyomino is the number of empty cells connected to the polyomino by an edge. A formula for the minimum site-perimeter with a given cell size is found. This formula is used to show the effectiveness of a simple random strategy in polyomino set achievement games.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/8250